Size-constrained 2-clustering in the plane with Manhattan distance
نویسندگان
چکیده
We present an algorithm for the 2-clustering problem with cluster size constraints in the plane assuming `1-norm, that works in O(n logn) time and O(n) space. Such a procedure also solves a full version of the problem, computing the optimal solutions for all possible constraints on cluster sizes. The algorithm is based on a separation result concerning the clusters of any optimal solution of the problem and on an extended version of red-black trees to maintain a bipartition of a set of points in the plane.
منابع مشابه
Repeated Record Ordering for Constrained Size Clustering
One of the main techniques used in data mining is data clustering, which has many applications in computer science, biology, and social sciences. Constrained clustering is a type of clustering in which side information provided by the user is incorporated into current clustering algorithms. One of the well researched constrained clustering algorithms is called microaggregation. In a microaggreg...
متن کاملIdentification of Structural Defects Using Computer Algorithms
One of the numerous methods recently employed to study the health of structures is the identification of anomaly in data obtained for the condition of the structure, e.g. the frequencies for the structural modes, stress, strain, displacement, speed, and acceleration) which are obtained and stored by various sensors. The methods of identification applied for anomalies attempt to discover and re...
متن کاملGeneralising Ward’s Method for Use with Manhattan Distances
The claim that Ward's linkage algorithm in hierarchical clustering is limited to use with Euclidean distances is investigated. In this paper, Ward's clustering algorithm is generalised to use with l1 norm or Manhattan distances. We argue that the generalisation of Ward's linkage method to incorporate Manhattan distances is theoretically sound and provide an example of where this method outperfo...
متن کاملComparative Study of Fuzzy k-Nearest Neighbor and Fuzzy C-means Algorithms
Fuzzy clustering techniques handle the fuzzy relationships among the data points and with the cluster centers (may be termed as cluster fuzziness). On the other hand, distance measures are important to compute the load of such fuzziness. These are the two important parameters governing the quality of the clusters and the run time. Visualization of multidimensional data clusters into lower dimen...
متن کاملManhattan Distance Based Affinity Propagation Technique for Clustering in Remote Sensing Images
Cluster analysis partitions a dataset into a reasonable number of disjoint groups, where each group contains similar patterns. Due to a high number of spectral channels hyper Remote Sensing are difficult to classify with high accuracy and efficiency. In this paper we propose a new image clustering method MD-AP( Manhattan Distance Based Affinity Propagation) for extract the Land cover Classifica...
متن کامل